Linear Substitutions and their Invariants

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Splice Graphs and their Vertex-Degree-Based Invariants

Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

Linear Explicit Substitutions ( Extended

The -calculus [1] adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implementation of functional programming languages can be studied. This paper generalises the -calculus to provide a linear calculus of explicit substitutions which analogously describes the implementation of linear functional programming languages.

متن کامل

Linear Explicit Substitutions

The-calculus adds explicit substitutions to the-calculus so as to provide a theoretical framework within which the implementation of functional programming languages can be studied. This paper gen-eralises the-calculus to provide a linear calculus of explicit substitutions , called xDILL, which analogously describes the implementation of linear functional programming languages. Our main observa...

متن کامل

Block Substitutions and Their Properties

We introduce a type of substitution operation inspired by errors occurring in biologically encoded information. We derive the closure properties of language families in the Chomsky hierarchy under these substitution operations. Moreover, we consider some language equations involving these operations and investigate decidability of the existence of solutions to such equations.

متن کامل

Linear Maps Preserving Invariants

Let G ⊂ GL(V ) be a complex reductive group. Let G denote {φ ∈ GL(V ) | p◦φ = p for all p ∈ C[V ]}. We show that, in general, G = G. In case G is the adjoint group of a simple Lie algebra g, we show that G is an order 2 extension of G. We also calculate G for all representations of SL2.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1911

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500034052